On an Extensible Rule-Based Prover for Event-B
نویسندگان
چکیده
The Rodin platform [3] provides the practical setting to carry out modelling in Event-B. It seamlessly integrates modelling and proving, and provides an extensible and configurable mechanism that can be adapted to different application domains and development methods [1]. The Rodin platform provides a proving infrastructure that has certain limitations. Extending the prover with proof rules (rewrite and inference rules) requires a certain level of competence using the Java programming language as well as good knowledge of the toolset’s internal architecture. A further complication of this approach is that it became non-trivial to verify the soundness of the prover after adding new rules. This paper presents our approach when dealing with prover extensibility and soundness in the context of Event-B.
منابع مشابه
Analysis of Applying Event-triggered Strategy on the Model Predictive Control
In this paper, the event-triggered strategy in the case of finite-horizon model predictive control (MPC) is studied and its advantages over the input to state stability (ISS) Lyapunov based triggering rule is discussed. In the MPC triggering rule, all the state trajectories in the receding horizon are considered to obtain the triggering rule. Clearly, the finite horizon MPC is sub-optimal with ...
متن کاملE-DEVICE: An Extensible Active Knowledge Base System with Multiple Rule Type Support
This paper describes E-DEVICE, an extensible active knowledge base system (KBS) that supports the processing of event-driven, production, and deductive rules into the same active OODB system. E-DEVICE provides the infrastructure for the smooth integration of various declarative rule types, such as production and deductive rules, into an active OODB system that supports low-level event-driven ru...
متن کاملA Deductive Object-Oriented Database System based on Active Rules∗
This paper describes a Deductive Object-Oriented Database (DOOD) system that is built on top of an active Object-Oriented Database (OODB) system. The system, named DEVICE, uses the primitives of the latter, like active rules, simple and complex events, to integrate deductive and production rules. The integration is based on the emulation of deductive rules by special purpose if-then-else produc...
متن کاملInferring Function Semantics to Optimize Queries
The goal of the COKO-KOLA project [10, 9] is to express rules of rule-based optimizers in a manner permitting verification with a theorem prover. In [10], we considered query transformations that were too general to be expressed with rewrite rules. In this paper, we consider the complementary issue of expressing query transformations that are too specifc for rewrite rules. Such transformations ...
متن کاملRewriting and Well-Definedness within a Proof System
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving between deduction and computation (i.e., rewriting) steps. If the logic of reasoning supports partial functions, it is necessary that rewriting copes with pot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010